Plane triangulations are 6-partitionable
نویسندگان
چکیده
Given a graph G = (V; E) and k positive integers n1; n2; : : : ; nk such that ∑k i=1 ni = |V |, we wish to 2nd a partition P1; P2; : : : ; Pk of the vertex set V such that |Pi| = ni and Pi induces a connected subgraph of G for all i; 16 i6 k. Such a partition is called a k-partition of G. A graph G with n vertices is said to be k-partitionable if there exists a k-partition of G for any partition of n into k parts. Lov5 asz (Acta Math. Acad. Sci. Hungar. 30 (1977) 241) showed that k-connected graphs are k-partitionable. In this paper we prove that plane triangulations are 6-partitionable. This result is the best possible as there exist plane triangulations which are not
منابع مشابه
Median problem in some plane triangulations and quadrangulations
Résumé In this note, we present linear time algorithms for computing the median set of plane triangulations with inner vertices of degree ≥ 6 and plane quadrangulations with inner vertices of degree ≥ 4. Dans cette note, nous présentons un algorithme linéaire pour calculer l’ensemble médian de triangulations planaires dont les sommets intérieurs sont de degré ≥ 6 et de quadrangulations planaire...
متن کاملGenerating All Triangulations of Plane Graphs
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices. Our algorithm establishes a tree structure among the triangulations of G, called the “tree of triangulations,” and generates each triangulation of G in O(1) time. The algorithm uses O(n) space and generate...
متن کاملOn 3-coloring of plane triangulations
Let G be a plane triangulation. For a color-assignment λ : V (G) → {1, 2, 3}, a face of G whose vertices receive all three colors is called a vivid face with respect to λ. Let hλ(G) be the number of vivid faces in G with respect to λ. Let C(G) be the set of 3-color-assignments of G and let G(n) be the set of plane triangulations with n faces. Let h(G) = max{hλ(G) : λ ∈ C(G)} and h(n) = min{h(G)...
متن کامل3-Colorability of Pseudo-Triangulations
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain classes of plane graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-triangulations (a generalization of triangulations) and prove NP-completeness for this class. The complexity status does not change if the maximum face-degree is bounded to fo...
متن کاملFlip Graphs of Degree-Bounded (Pseudo-)Triangulations⋆
We study flip graphs of (pseudo-)triangulations whose maximum vertex degree is bounded by a constant k. In particular, we consider (pseudo-)triangulations of sets of n points in convex position in the plane and prove that their flip graph is connected if and only if k > 6; the diameter of the flip graph is O(n). We also show that for general point sets flip graphs of minimum pseudo-triangulatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 256 شماره
صفحات -
تاریخ انتشار 2002